MARGINAL CHECKING OF A MARKOVIAN DEGRADATION UNIT WHEN CHECKING INTERVAL IS PROBABILISTIC
نویسندگان
چکیده
منابع مشابه
Marginal Checking of a Markovian Degradation Unit When Checking Interval Is Probabilistic
Marginal checking of a Markovian degradation unit is treated when time interval to the next checking is not fixed but obeys a certain general distribution. The problem of determing the optimal set of the states at which the unit is replaced with a new one (marginal set) is discussed. It is solved by using Markov-renewal programming with modified policy iteration cycle. It is showed that control...
متن کاملProbabilistic Bisimulations for PCTL Model Checking of Interval MDPs
Verification of PCTL properties of MDPs with convex uncertainties has been investigated recently by Puggelli et al. However, model checking algorithms typically suffer from state space explosion. In this paper, we address probabilistic bisimulation to reduce the size of such an MDPs while preserving PCTL properties it satisfies. We discuss different interpretations of uncertainty in the models ...
متن کاملProbabilistic Model Checking
Markov chains (MC) and Markov decision processes (MDP) are widely used as operational models for the quantitative system analysis. They can be understood as transition systems augmented with distributions for the states (in MC) or state-action pairs (in MDPs) to specify the probabilities for the successor states. Additionally one might add weight functions for modeling accumulated costs or rewa...
متن کاملChecking probabilistic noninterference using JOANA
JOANA is a tool for software security analysis, checking up to 100kLOC of full multi-threaded Java. JOANA is based on sophisticated program analysis techniques and thus very precise. It includes a new algorithm guaranteeing probabilistic noninterference, named RLSOD. JOANA needs few annotations and has a nice GUI. The tool is open source and was applied in several case studies. The article pres...
متن کاملCounterexamples in Probabilistic Model Checking
This paper considers algorithms for counterexample generation for (bounded) probabilistic reachability properties in fully probabilistic systems. Finding the strongest evidence (i.e, the most probable path) violating a (bounded) until-formula is shown to be reducible to a single-source (hop-constrained) shortest path problem. Counterexamples of smallest size that are mostly deviating from the r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operations Research Society of Japan
سال: 1976
ISSN: 0453-4514,2188-8299
DOI: 10.15807/jorsj.19.158